Abstract No: 025-0701 Title: A Genetic Algorithm Approach for Nurse Scheduling in an Operating suite
نویسندگان
چکیده
No: 025-0701 Title: A Genetic Algorithm Approach for Nurse Scheduling in an Operating suite Elham Torabi Department of Operations, Business Analytics and Information Systems 534 Carl H. Lindner College of Business University of Cincinnati 2925 Campus Green Dr. Cincinnati OH 45221 [email protected], (513) 288-2546 Gino J. Lim Department of Industrial Engineering University of Houston E211 Engineering Building 2, Houston, TX 77204 [email protected], (713) 743-4194 Craig M. Froehle Department of Operations, Business Analytics and Information Systems 521 Carl H. Lindner College of Business University of Cincinnati 2925 Campus Green Dr. Cincinnati OH 45221 [email protected] , (513) 556-7174 POMS 23rd Annual Conference Chicago, Illinois, U.S.A. April 20 to April 23, 2011 A Genetic Algorithm Approach for Nurse Assignment Problem in an Operating suite Abstract In this paper we present a Genetic Algorithm approach for scheduling operating room (OR) nurses. Most studies in operating room scheduling deal with patient flow analysis and physician scheduling, limited literature has focused on scheduling OR nurses. Our objective is to minimize nurses’ idle time, overtime and non-consecutive assignments during overtime hours while maximizing demand satisfaction. The major constraints are: 1) shift constraints and 2) match between nurses’ skill sets and surgery requirements. Due to the large size of the problem, finding an optimal solution is extremely difficult. Therefore, a Genetic Algorithms approach is proposed to find a set of good schedules in a reasonable amount of time. The solutions were then evaluated in a simulation model with probabilistic surgery durations. The best performing solution in the stochastic environment is selected as the final schedule. We present a set of case studies to demonstrate the performance of our approach. We used sample data gathered from a large urban teaching hospital that has 31 operating rooms.In this paper we present a Genetic Algorithm approach for scheduling operating room (OR) nurses. Most studies in operating room scheduling deal with patient flow analysis and physician scheduling, limited literature has focused on scheduling OR nurses. Our objective is to minimize nurses’ idle time, overtime and non-consecutive assignments during overtime hours while maximizing demand satisfaction. The major constraints are: 1) shift constraints and 2) match between nurses’ skill sets and surgery requirements. Due to the large size of the problem, finding an optimal solution is extremely difficult. Therefore, a Genetic Algorithms approach is proposed to find a set of good schedules in a reasonable amount of time. The solutions were then evaluated in a simulation model with probabilistic surgery durations. The best performing solution in the stochastic environment is selected as the final schedule. We present a set of case studies to demonstrate the performance of our approach. We used sample data gathered from a large urban teaching hospital that has 31 operating rooms.
منابع مشابه
A genetic algorithm approach for problem
In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i j, the duration of this set-up being the sequ...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملA knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells
This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012